A Complete Finite Prefix for Process Algebra
نویسندگان
چکیده
In this paper we show how to use McMillan’s complete finite prefix approach for process algebra. We present the model of component event structures as a semantics for process algebra, and show how to construct a complete finite prefix for this model. We present a simple adequate order (using an order on process algebra expressions) as an optimization to McMillan’s original algorithm.
منابع مشابه
A Complete Axiomatization for Prefix Iteration in Branching Bisimulation
This paper studies the interaction of prefix iteration with the silent step in the setting of branching bisimulation. We present a finite equational axiomatization for Basic Process Algebra with deadlock, empty process and the silent step, extended with prefix iteration, and prove that this axiomatization is complete with respect to rooted branching bisimulation equivalence.
متن کاملA Complete Equational Axiomatization for Prefix Iteration
Prefix iteration a∗x is added to Minimal Process Algebra (MPAδ), which is a subalgebra of BPAδ equivalent to Milner’s basic CCS. We present a finite equational axiomatization for MPA∗ δ , and prove that this axiomatization is complete with respect to strong bisimulation equivalence. To obtain this result, we set up a term rewriting system, based on the axioms, and show that bisimilar terms have...
متن کاملDeriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding
The starting point of this paper is McMillan’s complete finite prefix of an unfolding that has been obtained from a Petri net or a process algebra expression. The paper addresses the question of how to obtain the (possibly infinite) system behaviour from the complete finite prefix. An algorithm is presented to derive from the prefix a graph rewriting system that can be used to construct the unf...
متن کاملHildesheimer Informatik - Berichte Universität
This paper is about partially ordered multisets (pomsets for short). We investigate a particular class of pomsets that we call deterministic, properly including all partially ordered sets, which satisfies a number of interesting properties: among other things, it forms a distributive lattice under pomset prefix (hence prefix closed sets of deterministic pomsets are prime algebraic), and it cons...
متن کاملCombining symbolic and partial order methods for model checking 1-safe Petri nets
In this work, methods are presented for model checking finite state asynchronous systems, more specifically 1-safe Petri nets, with the aim of alleviating the state explosion problem. Symbolic model checking techniques are used, combined with two partial order semantics known as net unfoldings and processes. We start with net unfoldings and study deadlock and reachability checking problems, usi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999